Scalable Scheduling in Parallel Processors
نویسندگان
چکیده
A study of scalable data intensive scheduling involving load distribution on multi-level fat tree networks is presented. It is shown that the speedup of processing divisible loads concurrently on a homogeneous single level tree increases linearly as the number of processors is increased. This behavior is markedly different from that of past research on sequential scheduling where speedup saturates beyond a certain number of processors. It is demonstrated that the ultimate limiting factor for speedup is due to hardware, not to the scheduling strategy on a multi-level fat tree.
منابع مشابه
New Formulation and Solution in PCB Assembly Systems with Parallel Batch processors
This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...
متن کاملGreen Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملParallel Multiplication of a Vector by a Kronecker Product of Matrices (Part II)
The paper provides a generalization of our previous algorithm for the parallel multiplication of a vector by a Kronecker product of matrices. For any p, a factor of the problem size, our algorithm runs on p processors with a minimum number of communication steps and memory space. Specifically, on p processors with global communication, we show that the multiplication requires at least Θ(log(p))...
متن کاملOn-line scheduling of scalable real-time tasks on multiprocessor systems
Previous researches on real-time scheduling assume that the number of processors required to execute a task is xed and its computation time is given based on this xed number of processors. However, in multiprocessor systems, the computation time of scal-able task varies depending on the number of processors allocated to it. By determining a proper number of processors to be allocated to each re...
متن کاملDynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture
Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...
متن کامل